Games of Length Ω1

نویسنده

  • ITAY NEEMAN
چکیده

We prove determinacy for open length ω1 games. Going further we introduce, and prove determinacy for, a stronger class of games of length ω1, with payoff conditions involving the entire run, the club filter on ω1, and a sequence of ω1 disjoint stationary subsets of ω1. The determinacy proofs use an iterable model with a class of indiscernible Woodin cardinals, and we show that the games precisely capture the theory of the minimal model for this assumption. The purpose of this paper is to bring determinacy to the level of games of length ω1. For a set A ⊂ ω1 define Gopen−ω1(A) to be the following game: Players I and II alternate playing natural numbers as in Diagram 1 to create r ∈ ω1 . Player I wins if there exists some α < ω1 so that r↾α belongs to A, and otherwise II wins. Such games are called open length ω1 games, as victory by player I, if achieved, is secured at a strict initial segment of the run. By definable open length ω1 games we mean games Gopen−ω1(A) with A which is Π 1 1 in the codes. (We could relax to projective in the codes, or to lightface definable over L(R), instead of Π1. This would not affect the strength of the resulting class of games, since any number of extra real quantifiers in the payoff can be absorbed by moves in Gopen−ω1 .) These games trace back to Steel [7, 5] who proved various results assuming their determinacy, including propagation of scales and existence of definable winning strategies. I r(0) r(2) . . . r(2ξ) . . . . . . II r(1) . . . r(2ξ + 1) . . . . . . Diagram 1. Games of length ω1. We prove in this paper that these and even stronger games are determined, assuming the existence of an iterable model with a class of indiscernible Woodin cardinals. This precise large cardinal assumption had been expected, and indeed it was already known through work of Steel to be optimal, in the sense that no weaker large cardinal assumption proves the determinacy of definable open games of length ω1. Steel showed this by noting that the minimal iterable model with a class of indiscernible Woodin cardinals does not satisfy definable open length ω1 determinacy. It had also been known from work of Steel and This material is based upon work supported by the National Science Foundation under Grant No. DMS-0094174.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winning the pressing down game but not Banach-Mazur

Let S be the set of those α ∈ ω2 that have cofinality ω1. It is consistent relative to a measurable that the nonempty player wins the pressing down game of length ω1, but not the Banach Mazur game of length ω+1 (both games starting with S).

متن کامل

How to Win Some Simple Iteration Games

We introduce two new iteration games: the game G, which is a strengthening of the weak iteration game, and the game G, which is somewhat stronger than G but weaker than the full iteration game of length ω1. For a countable M elementarily embeddable in some Vη, we can show that II wins G(M,ω1) and that I does not win the G (M).

متن کامل

The length-ω1 open game quantifier propagates scales

[T ] is just a typical closed set in the topology on ω1 whose basic neighborhoods are the sets of the form Np = {f : ω1 → ω | p ⊆ f}, where p : α → ω for some countable α. Associated to T is a closed game G(T ) on ω of length ω1: at round α in G(T ), player I plays mα, then player II plays nα. Letting f(α) = 〈mα, nα〉 for all α < ω1, we say that player II wins the run of G(T ) determined by f if...

متن کامل

The canonical function game

The canonical function game is a game of length ω1 introduced by W. Hugh Woodin which falls inside a class of games known as Neeman games. Using large cardinals, we show that it is possible to force that the game is not determined. We also discuss the relationship between this result and Σ2 absoluteness, cardinality spectra and Π2 maximality for H(ω2) relative to the Continuum Hypothesis. MSC20...

متن کامل

Some Axioms of Weak Determinacy

We consider two-player games of perfect information of length some cardinal κ. It is well-known that for κ ≥ ω1 the full axiom of determinacy for these games fails, thus we investigate three weaker forms of it. We obtain the measurability of κ under DCκ-the axiom of dependent choices generalized to κ. We generalize the notions of perfect and meager sets and provide characterizations with some s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007